Informatics Publishing Limited

K. Ponmozhi ¹, R. S. Rajesh ²

Affiliations
1 Mother Teresa Women's University, Kodaikannal, IN
2 Computer Science and Engineering Department, Manonmaniam Sundaranar University, Tirunelveli, IN

Abstract

Traffic carried by wireless networks may be a mix of real-time traffic such as voice, multimedia, messaging and file transfer and applications on them requires service/resource sharing. Each application will require varying and very diverse QoS guarantees. The cross layer design can potentially solve some of these problems in wireless communication and thus the provisioning of QoS level required by the applications. Layering of MANETs may be violated in order to implement autonomic behavior such as service provisioning. This cross layering depends on correlating data from various layers to identify major and relevant events related to the application design requirements. We proposed cross layer which lies between the application and the lower layers also it spans across the other layers vertically. In this paper the mechanism for accessing the cross layer information has been proposed and predictors to predict the event happening based on the collected data. The application or the other layers can access these values and do adaptation to the existing environment by subscribing to the needed predictors. We designed predictors namely data rate predictor, Bandwidth estimator, and Link qualification. To show case our design the routing algorithm has changed to take in to consideration of the link, and SNR which shows better result.

Keywords

Cross Layer, Mobile Ad Hoc Networks.

Full Text

     

E. Sivasankar ¹, R. S. Rajesh ²

Affiliations
1 Department of Computer Science & Engineering, National Institute of Technology, Trichy, Tamil Nadu, IN
2 Department of Computer Science & Engineering, Manomaniam Sundarenar University, Tirunelveli, Tamil Nadu, IN

Abstract

In this paper, we have proposed a Genetic Algorithm based feature selection approach for clinical decision support system, which is designed to assist physicians with decision making tasks, as to discriminate healthy people from those with Parkinson's disease. We have compared the performance of Genetic Algorithm with two feature ranking algorithms namely Chi-Square algorithm and Information Gain. The genetic algorithm that we propose is wrapper based scheme where the fitness of an individual is determined based on the ability of the selected features to classify the training dataset. To measure the performance of the feature selection algorithms, two different types of standard classification algorithms were implemented namely Bayesian Classifier and K-Nearest Neighbor (K-NN) Classifier. We determine which feature selection algorithm is best suited for clinical datasets under consideration. Experiments show that Genetic Algorithm would be the best choice for feature selection in Parkinson's clinical dataset.

Keywords

Feature Selection, Genetic Algorithm, Clinical Datasets, Classification.

Full Text

     

K. Jaya Priya ¹, R. S. Rajesh ²

Affiliations
1 Department of Computer Science, Mother Teresa Women's University, Kodaikanal-624102, IN
2 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli-627012, Tamilnadu, IN

Abstract

In this paper, we propose an approach for handling expression and pose variations in face recognition with single sample per class. The local appearance based methods have been successfully applied to face recognition and achieved state-of-the-art performance. The Gabor Binary Code approach has the robust properties against facial expression, illumination, accessories and etc. In this paper we enhance the robustness of GBC in the form of Multi Scale Gabor Ternary Code (GTC) for pose variation with large rotation angle. Normally most of the local appearance based methods the facial features are extracted from several local regions and concatenated into an enhanced feature vector as a face descriptor. In this approach we divide the face into several (m×m) non overlapped parallelogram blocks instead of square or rectangle blocks as well as the wavelet transformed low frequency band of the face image is used to generate Gabor ternary code. The parallelogram blocks based comparison improves the performance of face recognition under perspective and expression variation. Experiments on Indian face dataset faces with large rotation angle up to 180θ and ORL datasets shows that the proposed approach outperforms GBC in the scenario of one training sample per person.

Keywords

Discrete Wavelet Transform Gabor Binary Code, Gabor Filter, Parallelogram Regions, Local Binary Pattern.

Full Text

     

A. John ¹, M. Sugumaran ², R. S. Rajesh ¹

Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN
2 Department of Computer Science and Engineering, Pondicherry Engineering College, IN

Abstract

Indexing and query processing is an emerging research field in spatio - temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are based on spatio-temporal indexing and query processing. All the indexing and query processing applications is any one of the forms, such as spatio index access and supporting queries or spatio-temporal indexing method and support query or temporal dimension, while in spatial data it is considered as the second priority. In this paper, give the survey of the various uncertain indexing and query processing techniques. Most of the existing survey works on spatio-temporal are based on indexing methods and query processing, but presented separately. Both the indexing and querying are related, hence state - of - art of both the indexing and query processing techniques are considered together. This paper gives the details of spatio-temporal data classification, various types of indexing methods, query processing, application areas and research direction of spatio-temporal indexing and query processing.

Keywords

Uncertain Data, Spatio-Temporal Index, Spatio-Temporal Queries, Skyline Query, Top-K Query, Nearest-Neighbor Query.

Full Text

     

K. Ponmozhi ¹, R. S. Rajesh ²

Affiliations
1 Department of Information Technology, Hajee Karutha Rowther Howdia College, IN
2 Department of Computer Science and Engineering, Manonmanium Sundarnar University, IN

Abstract

Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way and can be discovered, configured and used by other devices with minimum of manual efforts. Automatic service discovery plays an important role in future network scenarios. Service discovery in distributed environment is difficult that too if the availability information of the services cannot be in a centralized node. The complexity is increased even further in the case of MANETs in which there will not be central intelligence also, the nodes involved may be on the move. The mobility issue leads to the situation of uncertainty about the service availability of the service provider. In this paper we propose a decentralized discovery mechanism. The basic idea is, distributing service information along with the availability metrics to the nodes. The metrics will give us the information to evaluate the goodness of the service provider. Every node will form multi-layered overlays of service providers sorted based on the metrics. When we send a query, each node will identify the service provider from the overlay with the good metric among the available providers (i.e.) the one in the first position in the overlay. We define the message structures and methods needed for this proposal. The simulation result shows that in the high mobile environment too we could have a better convergence. We believe that the architecture presented here is a necessary component of any service provision framework.

Keywords

Mobile Ad Hoc Networks, Service Discovery.

Full Text

     

J. L. Walter Jeyakumar ¹, R. S. Rajesh ¹

Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, IN

Abstract

We present a mobile transaction framework in which mobile users can share data which is stored in the cache of a mobile agent. This mobile agent is a special mobile node which coordinates the sharing process. The proposed framework allows mobile affiliation work groups to be formed dynamically with a mobile agent and mobile hosts. Using short range wireless communication technology, mobile users can simultaneously access the data from the cache of the mobile agent. The data Access Manager module at the mobile agent enforces concurrency control using cache invalidation technique. This model supports disconnected mobile computing allowing mobile agent to move along with the Mobile Hosts. The proposed Transaction frame work has been simulated in Java 2 and performance of this scheme is compared with existing frame works.

Keywords

Transaction, Concurrency Control, Mobile Database, Cache Invalidation, Mobility.

Full Text

     

C. Morris ¹, R. S. Rajesh ¹

Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN

Abstract

The objective of Image fusion is to combine the information from number of images of the same scene from different sensors or the images with focus on different objects. The result of image fusion is an image which is more informative and of better quality. In this paper a detailed survey of Select Maximum /Minimum and principal component analysis for spatial domain image fusion techniques is done. On the basis of the survey an improved spatial domain fusion technique is proposed. The proposed spatial domain technique output performs as the state of the art spatial domain techniques.

Keywords

Spatial Domain, Simple Maximum/Minimum, PCA.

Full Text

     

D. Kesavaraja ¹, R. Balasubramanian ², R. S. Rajesh ², D. Sasireka ³

Affiliations
1 Department of Computer Science and Engineering, Dr. Sivanthi Aditanar College of Engineering, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tamil Nadu, IN
3 Department of Information Technology, Jayamatha Engineering College, Tamil Nadu, IN

Abstract

This paper presents efficient and portable implementations of a useful image segmentation technique which makes use of the faster and a variant of the conventional connected components algorithm which we call parallel Components. In the Modern world majority of the doctors are need image segmentation as the service for various purposes and also they expect this system is run faster and secure. Usually Image segmentation Algorithms are not working faster. In spite of several ongoing researches in Conventional Segmentation and its Algorithms might not be able to run faster. So we propose a cluster computing environment for parallel image Segmentation to provide faster result. This paper is the real time implementation of Distributed Image Segmentation in Clustering of Nodes. We demonstrate the effectiveness and feasibility of our method on a set of Medical CT Scan Images. Our general framework is a single address space, distributed memory programming model. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an efficient cluster process which uses a novel approach for parallel merging. Our experimental results are consistent with the theoretical analysis and practical results. It provides the faster execution time for segmentation, when compared with Conventional method. Our test data is different CT scan images from the Medical database. More efficient implementations of Image Segmentation will likely result in even faster execution times.

Keywords

Parallel Algorithms, Region Growing, Image Enhancement, Image Segmentation, Parallel Performance.

Full Text

     

K. Jaya Priya ¹, R. S. Rajesh ²

Affiliations
1 Mother Teresa Women’s University, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tamil Nadu, IN

Abstract

In this paper, we propose novel face recognition method based on local appearance feature extraction using hybrid mode of local ridge-let and fused dual-tree complex wavelet transform (DT-CWT). It provides a local multiscale description of images with good directional selectivity, effective edge representation and invariance to shifts and in-plane rotations. In the dual-tree implementation, two parallel dis-crete wavelet transform (DWT) with different lowpass and highpass filters in different scales are used. The linear combination of sub-bands generated by two parallel DWT is used to generate 6 different directional subbands with complex coefficients. It is insensitive to illumination variations and facial expression changes. 2-D dual-tree complex wavelet transform is less redundant and computationally efficient. The fusion of local DT-CWT coefficients of detail subbands and local Finite Ridgelet Transform (FRIT) coefficients of approxi-mate subbands of DT-CWT are used to extract the facial features which improve the face recognition with small sample size in less computation. The local features based methods have been success-fully applied to face recognition and achieved state-of-the-art per-formance. Normally most of the local appearance based methods the facial features are extracted from several local regions and concate-nated into an enhanced feature vector as a face descriptor. In this approach we divide the face into several (m×m) non-overlapped paral-lelogram blocks instead of square or rectangle blocks. The local mean and standard deviation of hybrid FRIT and fused DT-CWT coeffi-cients are used to describe the face image. Experiments, on two well-known databases, namely, Yale and ORL databases, shows the Local hybrid FRIT and fused DT-CWT approach performs well on illumi-nation, expression and perspective variant faces with single sample compared to PCA and global DT-CWT. Furthermore, in addition to the consistent and promising classification performances, our pro-posed Hybrid Local FRIT and fused DT-CWT based method has a really low computational complexity.

Keywords

Gabor Wavelet Transform, Finite Ridgelet Transform, Dual Tree Discrete Wavelet Transform, Dual Tree Complex Wavelet Transform, PCA, Parallelogram Regions.

Full Text

     

Dejey ¹, R. S. Rajesh ¹

Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN

Abstract

In this paper, two approaches for color image watermarking in the wavelet domain are proposed. The first approach utilizes only the chrominance content of the color image for watermarking after performing a single level DWT (Discrete Wavelet Transform) decomposition and hence named as DWTC whereas the second approach utilizes both the luminance and chrominance content for watermarking and hence termed as DWTLC. Watermark which is a logo is scrambled before embedding to increase its robustness. Watermarking is done on the approximation band coefficients chosen randomly by a function in Lab space. Both the proposed approaches result in watermarked images of high quality. The robustness of both the approaches is verified by the conduct of various attacks on the watermarked images and is compared with an existing SCDFT based approach and a DWT based approach. Experimental results show that DWTC is robust to non geometric attacks like filtering, blurring, sharpening, histogram equalization, JPEG compression and to geometric attacks like additive noise and scaling. DWTLC watermarking also shows robustness to all the above attacks. Further, both the approaches resist collusion attack even with a minimum number of colluders and with increasing number of colluders there is much distortion in the visual quality of the colluded images.

Keywords

DWT, Luminance, Chrominance, Attacks, Collusion.

Full Text

     

S. Arun Mozhi Selvi ¹, R. S. Rajesh ²

Affiliations
1 Department of Information Technology, Dr. Sivanthi Aditanar College of Engineering, IN
2 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, IN

Abstract

Spam is commonly defined as unsolicited email messages and the goal of spam categorization is to distinguish between spam and legitimate email messages. The economics of spam details that the spammer has to target several recipients with identical and similar email messages. As a result a dynamic knowledge sharing effective defense against a substantial fraction of spam has to be designed which can alternate the burdens of frequent training stand alone spam filter. A weighted email attribute based classification is proposed to mainly focus to encounter the issues in normal email system. These type of classification helps to formulate an effective utilization of our email system by combining the concepts of Bayesian Spam Filtering Algorithm, Iterative Dichotmiser 3(ID3) Algorithm and Bloom Filter. The details captured by the system are processed to track the original sender causing disturbances and prefer them to block further mails from them. We have tested the effectiveness of our scheme by collecting offline data from Yahoo mail&Gmail dumps. This proposal is implemented using .net and sample user-Id for knowledge base.

Keywords

Spam, Bayesian, IMAP, ID3.

Full Text

     

V. Lalitha ¹, R. S. Rajesh ²

Affiliations
1 Dept. of Computer Science, Govt. Arts College, Pudukkottai, TN, IN
2 Dept. of Computer Science and Engg, M.S. University, Tirunelveli, TN, IN

Abstract

A Mobile Ad Hoc Network is a collection of mobile wireless nodes connected together to form a dynamic network without the need for any fixed infrastructure. This dynamic and unpredictable nature of MANETs requires multi-path routing. In multipath routing multiple paths are established between a source and destination pair of nodes. Multi-path routing provides several benefits such as fault-tolerance, load balancing etc. Transmission power of nodes plays an important role in MANET communication. Now, let us assume that each node can dynamically control the transmission power it uses independently of other nodes. The objective of this work is to study the behavior and performance of the two multi-path MANET routing protocols with respect to different transmission range/power of individual nodes of the network. We have selected Ad Hoc On-Demand Multi-path Distance Vector (AOMDV) Routing Protocol and Multi-path Dynamic Address Routing (MDART) Protocol for this study. We will analyze the impact of increase in transmission range/power of individual nodes on the performance of these multi-path MANET routing protocols.

Keywords

Ad Hoc Network, AOMDV, MANET, MDART, Transmission Range, Transmission Power.

Full Text

   

M. K. Jeya Kumar ¹, R. S. Rajesh ²

Affiliations
1 M.G.R University, Chennai, Tamilnadu, IN
2 M.S University, Tirunelveli, Tamilnadu, IN

Abstract

Ad Hoc Networks is a multi - hop wireless network with dynamically changing network connectivity owing to mobility. It consists of a collection of wireless mobile nodes it will act without the use of any existing infrastructure or centralized administration. With this flexibility, networks can be formed anywhere, at any time, as long as two or more wireless users are willing to communicate. In such a dynamic network routing is a challenging problem Different routing protocols are designed assuming certain mobility patterns of the mobile nodes in the network. However the choice of mobility pattern may favor certain protocols over the others. Hence it is necessary to study the performance of different routing protocols under different mobility models. In this work two mobility models with high mobility and Low mobility constraints have been considered which mirror the realistic mobility patterns of the mobility nodes with high mobility and low mobility. The two reactive protocols AODV and DSR are examined based on the traces derived for each of these mobility models for various speed of the mobile nodes, Traffic and Node Density in the network. An analysis of the results obtained from the simulations shows that the AODV protocols in Boundless Simulation Area model performs better than DSR. Based on the observations, it is to suggest that AODV routing protocol can be used under high mobility since it outperforms DSR protocols.

Keywords

Ad Hoc Networks, Mobility Models, AODV, TORA, Routing Protocols.

Full Text

   

J. L. Walter Jeyakumar ¹, R. S. Rajesh ¹

Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, Tamilnadu, IN

Abstract

In this paper, we define a disconnected transaction management scheme for agent based mobile networks. This scheme proposes an environment in which mobile users can have simultaneous access to data by using the cache stored in the Fixed Agent. Data Access Manager module at the Fixed Agent controls the concurrency using invalidation technique. This approach supports disconnected transaction execution by allowing a disconnected mobile host to transfer transaction execution to the Data Access Manager in the fixed agent. The proposed transaction management scheme has been simulated in Java and performance of the scheme is presented.

Keywords

Transaction, Concurrency Control, Mobile Host, Fixed Agent, Cache Invalidation.

Full Text

   

J. Radhakrishnan ¹, R. S. Rajesh ²

Affiliations
1 Department of Computer Science, Vinayaka Missions University, Salem, Tamilnadu, IN
2 Dept. of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, Tamilnadu, IN

Abstract

This paper describes a Mobile Network Service helps Road Safety Purpose. A preprocessing steps reduces the search space in a safety way. Mobile Network Service applies Safety improvement and Location tracing, a technique that focuses the optimization on critical regions. The result indicates that the Mobile Network Services reliably identifies high quality solutions.

Keywords

Collision, Fixed Stations, Location Tracing, Mobile Nodes, Transceiver.

Full Text

   

B. Ramakrishnan ¹, R. S. Rajesh ², R. S. Shaji ³

Affiliations
1 Department of Computer Science, S.T Hindu College, Nagercoil-02, IN
2 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli-12, IN
3 Department of Computer Applications, St. Xaviers catholic College of Engineering, Nagercoil, IN

Abstract

VANET is a special class of Mobile Ad hoc Network. VANET is mainly used to model communication in a Vehicular environment where the vehicles are considered as VANET nodes with wireless links. In this paper an attempt has been made to create a new cluster model for efficient communication among the VANET nodes. For this purpose, taking the Simple Highway Vehicular model concept into consideration, a clustering model has been created. The proposed mobility model is called simple highway mobility model(SHWM). This paper focuses on the development of a clustering framework for communication among the VANET nodes. The various timings required for the formation of Clusters, Cluster head election time and Cluster head switching time are computed and presented. The proposed model can be used to characterize the Cluster Based Simple Highway Mobility Model (CBSHWM).

Keywords

VANET, MANET, SHWM, DRSC, OBU, CBVANET and CBSHWM.

Full Text